Deterministic and Stochastic Scheduling, Nato Advanced Study Institutes Series
-- part contents for background part 54
----- text -----
1982
-- part contents for background part 56
----- text -----
297-309
-- part contents for background part 57
----- text -----
M. A. Dempster, J. K. Lenstra, and A. H. G. Rinnooy Kan
-- part contents for background part 59
----- text -----
D. Reidel Publishing Co.
-- part contents for background part 68
----- text -----
If the activity-completion-times of a project-network are random variables the project completion-time is a random variable the distribution function of which is difficult to obtain.
This paper presents an approach using stochastic programming.
-- part contents for background part 69
----- text -----
network programming, scheduling theory, stochastic programming, finishing time